Set of Points on Elliptic Curve in Projective Coordinates

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set of Points on Elliptic Curve in Projective Coordinates

For simplicity, we use the following convention: x is a set, i, j are integers, n, n1, n2 are natural numbers, and K, K1, K2 are fields. Let K be a field. A field is called a subfield of K if it satisfies the conditions (Def. 1). (Def. 1)(i) The carrier of it ⊆ the carrier of K, (ii) the addition of it = (the addition of K) (the carrier of it), (iii) the multiplication of it = (the multiplicati...

متن کامل

Operations of Points on Elliptic Curve in Projective Coordinates

In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compell ProjCo and addell ProjCo are unary and binary operations of a point over the elliptic curve. The te...

متن کامل

A fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinates

A new fast addition algorithm on an elliptic curve over GF(2n) using the projective coordinates with x =X/Z and y = Y/Z2 is proposed.  2000 Elsevier Science B.V. All rights reserved.

متن کامل

Efficient Elliptic Curve Exponentiation Using Mixed Coordinates

Elliptic curve cryptosystems, proposed by Koblitz ((11]) and Miller ((15]), can be constructed over a smaller eld of deenition than the ElGamal cryptosystems ((5]) or the RSA cryptosystems ((19]). This is why elliptic curve cryptosystems have begun to attract notice. In this paper, we investigate eecient elliptic curve exponentiation. We propose a new coordinate system and a new mixed coordinat...

متن کامل

Eecient Elliptic Curve Exponentiation Using Mixed Coordinates

Elliptic curve cryptosystems, proposed by Koblitz ((12]) and Miller ((16]), can be constructed over a smaller eld of deenition than the ElGamal cryptosystems ((6]) or the RSA cryptosystems ((20]). This is why elliptic curve cryptosystems have begun to attract notice. In this paper, we investigate eecient elliptic curve exponentiation. We propose a new coordinate system and a new mixed coordinat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formalized Mathematics

سال: 2011

ISSN: 1898-9934,1426-2630

DOI: 10.2478/v10037-011-0021-6